Adaptive Incremental Mixture Markov Chain Monte Carlo
نویسندگان
چکیده
منابع مشابه
Adaptive Incremental Mixture Markov chain Monte Carlo
We propose Adaptive Incremental Mixture Markov chain Monte Carlo (AIMM), a novel approach to sample from challenging probability distributions defined on a general state-space. Typically, adaptive MCMC methods recursively update a parametric proposal kernel with a global rule; by contrast AIMM locally adapts a non-parametric kernel. AIMM is based on an independent Metropolis-Hastings proposal d...
متن کاملAdaptive Markov Chain Monte Carlo through Regeneration
Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/about/terms.html. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive only for your perso...
متن کاملAdaptive Markov Chain Monte Carlo Confidence Intervals
In Adaptive Markov Chain Monte Carlo (AMCMC) simulation, classical estimators of asymptotic variances are inconsistent in general. In this work we establish that despite this inconsistency, confidence interval procedures based on these estimators remain consistent. We study two classes of confidence intervals, one based on the standard Gaussian limit theory, and the class of so-called fixed-b c...
متن کاملOn Adaptive Markov Chain Monte Carlo Algorithms
Abstract We look at adaptive MCMC algorithms that generate stochastic processes based on sequences of transition kernels, where each transition kernel is allowed to depend on the past of the process. We show under certain conditions that the generated stochastic process is ergodic, with appropriate stationary distribution. We then consider the Random Walk Metropolis (RWM) algorithm with normal ...
متن کاملMarkov Chain Monte Carlo
Markov chain Monte Carlo is an umbrella term for algorithms that use Markov chains to sample from a given probability distribution. This paper is a brief examination of Markov chain Monte Carlo and its usage. We begin by discussing Markov chains and the ergodicity, convergence, and reversibility thereof before proceeding to a short overview of Markov chain Monte Carlo and the use of mixing time...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Graphical Statistics
سال: 2019
ISSN: 1061-8600,1537-2715
DOI: 10.1080/10618600.2019.1598872